An Algorithmic Approach to Chain Recurrence
نویسندگان
چکیده
منابع مشابه
An Algorithmic Approach to Chain Recurrence
In this paper we give a new definition of the chain recurrent set of a continuous map using finite spatial discretizations. This approach allows for an algorithmic construction of isolating blocks for the components of Morse decompositions which approximate the chain recurrent set arbitrarily closely as well as discrete approximations of Conley’s Lyapunov function. This is a natural framework i...
متن کاملAn algorithmic approach to resolutions
We provide an algorithmic method for constructing projective resolutions of modules over quotients of path algebras. This algorithm is modified to construct minimal projective resolutions of linear modules over Koszul algebras.
متن کاملAn algorithmic approach to Ramanujan-Kolberg identities
Let M be a given positive integer and r = (rδ)δ|M a sequence indexed by the positive divisors δ of M . In this paper we present an algorithm that takes as input a generating function of the form ∑∞ n=0 ar(n)q n := ∏ δ|M ∏∞ n=1(1−q )δ and positive integers m, N and t ∈ {0, . . . ,m−1}. Given this data we compute a set Pm,r(t) which contains t and is uniquely defined by m, r and t. Next we decide...
متن کاملBeyond Keyframing: An Algorithmic Approach to Animation
The use of physical system simulation has led to realistic animation of passive objects, such as sliding blocks or bouncing balls. However, complex active objects like human gures and insects need a control mechanism to direct their movements. We present a paradigm that combines the advantages of both physical simulation and algorithmic speciication of movement. The animator writes an algorithm...
متن کاملAn Algorithmic Approach to Quantum Field Theory
The lattice formulation provides a way to regularize, define and compute the Path Integral in a Quantum Field Theory. In this paper we review the theoretical foundations and the most basic algorithms required to implement a typical lattice computation, including the Metropolis, the Gibbs sampling, the Minimal Residual, and the Stabilized Biconjugate inverters. The main emphasis is on gauge theo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Foundations of Computational Mathematics
سال: 2005
ISSN: 1615-3375,1615-3383
DOI: 10.1007/s10208-004-0163-9